High Performance Graph Data Imputation on Multiple GPUs

نویسندگان

چکیده

In real applications, massive data with graph structures are often incomplete due to various restrictions. Therefore, imputation algorithms have been widely used in the fields of social networks, sensor and MRI solve completion problem. To keep relevant, a structure is represented by graph-tensor, which each matrix vertex value weighted graph. The convolutional algorithm has proposed low-rank graph-tensor problem that some matrices entirely unobserved. However, this limited application scope because it compute-intensive low-performance on CPU. paper, we propose scheme perform higher time performance GPUs (Graphics Processing Units) exploiting multi-core CUDA architecture. We optimization strategies achieve coalesced memory access for Fourier transform (GFT) computation improve utilization GPU SM resources singular decomposition (SVD) computation. Furthermore, design extend GPU-optimized implementation multiple large-scale computing. Experimental results show both fast accurate. On synthetic varying sizes, running single Quadro RTX6000 achieves up 60.50× speedups over GPU-baseline implementation. multi-GPU 1.81× two versus GPU. ego-Facebook dataset, 77.88× Meanwhile, CPU similar, low recovery errors.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High Performance Relevance Vector Machine on GPUs

The Relevance Vector Machine (RVM) algorithm has been widely utilized in many applications, such as machine learning, image pattern recognition, and compressed sensing. However, the RVM algorithm is computationally expensive. We seek to accelerate the RVM algorithm computation for time sensitive applications by utilizing massively parallel accelerators such as GPUs. In this paper, the computati...

متن کامل

Bitsliced High-Performance AES-ECB on GPUs

In order to perform high-performance Monte Carlo simulations of fracture in certain composite materials, we needed fast methods for generating deterministic random numbers. We made several design choices, and due to the fact that the entire simulation was to be done on both CPUs and GPUs, we designed new methods for fast implementation of the AES in the ECB mode on such architectures. This pape...

متن کامل

Multiple imputation and analysis for high‐dimensional incomplete proteomics data

Multivariable analysis of proteomics data using standard statistical models is hindered by the presence of incomplete data. We faced this issue in a nested case-control study of 135 incident cases of myocardial infarction and 135 pair-matched controls from the Framingham Heart Study Offspring cohort. Plasma protein markers (K = 861) were measured on the case-control pairs (N = 135), and the maj...

متن کامل

Multiple Imputation for Missing Data

Multiple imputation provides a useful strategy for dealing with data sets with missing values. Instead of filling in a single value for each missing value, Rubin’s (1987) multiple imputation procedure replaces each missing value with a set of plausible values that represent the uncertainty about the right value to impute. These multiply imputed data sets are then analyzed by using standard proc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Future Internet

سال: 2021

ISSN: ['1999-5903']

DOI: https://doi.org/10.3390/fi13020036